Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
نویسندگان
چکیده
Branching programs are a well-established computation model for boolean functions, especially read-once branching programs have been studied intensively. Exponential lower bounds for deterministic and nondeterministic read-once branching programs are known for a long time. On the other hand, the problem of proving superpolynomial lower bounds for parity read-once branching programs is still open. In this paper restricted parity read-once branching programs are considered and an exponential lower bound on the size of well-structured parity graph-driven read-once branching programs for integer multiplication is proven. This is the first strongly exponential lower bound on the size of a nonoblivious parity read-once branching program model for an explicitly defined boolean function. In addition, more insight into the structure of integer multiplication is yielded. ∗Supported in part by DFG grant WE 1066.
منابع مشابه
A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs
We prove an exponential lower bound 2 (n= logn) on the size of any randomized ordered read-once branching program computing integer multiplication. Our proof depends on proving a new lower bound on Yao's randomized one-way communication complexity of certain boolean functions. It generalizes to some other common models of randomized branching programs. In contrast, we prove that testing integer...
متن کاملA lower bound for integer multiplication on randomized ordered read-once branching programs
We prove an exponential lower bound (2 (n= log n)) on the size of any randomized ordered read-once branching program computing integer multiplication. Our proof depends on proving a new lower bound on Yao's ran-domized one-way communication complexity of certain boolean functions. It generalizes to some other common models of random-ized branching programs. In contrast, we prove that testing in...
متن کاملLower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs
We prove the first lower bound for restricted read–once parity branching programs with unlimited parity nondeterminism where for each input the variables may be tested according to several orderings. Proving a superpolynomial lower bound for read–once parity branching programs is still a challenging open problem. The following variant of read–once parity branching programs is well–motivated. Le...
متن کاملRestricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Branching programs are a well established computation model for Boolean functions, especially read-once branching programs have been studied intensively. In this paper the expressive power of nondeterministic read-once branching programs, i.e., the class of functions representable in polynomial size, is investigated. For that reason two restricted models of nondeterministic read-once branching ...
متن کاملLower bounds for restricted read-once parity branching programs
We prove the first lower bounds for restricted read–once parity branching programs with unlimited parity nondeterminism where for each input the variables may be tested according to several orderings. Proving a superpolynomial lower bound for read–once parity branching programs is an important open problem. The following variant is well–motivated more general than variants for that lower bounds...
متن کامل